Optimal Solution for VLSI Physical Design Automation Using Hybrid Genetic Algorithm

In Optimization of VLSI Physical Design, area minimization and interconnect length minimization is an important objective in physical design automation of very large scale integration chips. The objective of minimizing the area and interconnect length would scale down the size of integrated chips. To meet the above objective, it is necessary to find an optimal solution for physical design components like partitioning, floorplanning, placement, and routing. This work helps to perform the optimization of the benchmark circuits with the above said components of physical design using hierarchical approach of evolutionary algorithms. The goal of minimizing the delay in partitioning, minimizing the silicon area in floorplanning, minimizing the layout area in placement, minimizing the wirelength in routing has indefinite influence on other criteria like power, clock, speed, cost, and so forth. Hybrid evolutionary algorithm is applied on each of its phases to achieve the objective. Because evolutionary algorithm that includes one or many local search steps within its evolutionary cycles to obtain the minimization of area and interconnect length. This approach combines a hierarchical design like genetic algorithm and simulated annealing to attain the objective. This hybrid approach can quickly produce optimal solutions for the popular benchmarks

Adaptive position based Secured routing protocol for Mobile Ad Hoc Networks

Abstract: To develop routing protocol is an big challenge that meets the needs of different applications. There are several routing algorithm in mobile adhoc network, to make routing decisions at each node. It utilizes topology information. In location based routing protocols, nodes location information are used instead of node links. In position based routing protocols, the position information of its neighbor and packet destination node will be in the packet source node with its position information. In this we proposed a position based routing protocol called greedy. Most forward within radius (MFR) by using this packet forwarder node or source node, send packet to its neighbor, which is more forward towards destination node. Forward packet to neighbor nodes are not suitable for a condition by using distance deciding metric in greedy. The packet loss probability will increase, if the speed or battery power of closest neighbor towards destination node is more than the source or intermediate packet forwarder node. The proposed system uses combination of both position & energy routing protocol, which divides neighbor to send the packet